منابع مشابه
Closure of Hedge-automata Languages by Hedge Rewriting Closure of Hedge-automata Languages by Hedge Rewriting
We consider rewriting systems for unranked ordered terms, i.e. trees where the number of successors of a node is not determined by its label, and is not a priori bounded. The rewriting systems are defined such that variables in the rewrite rules can be substituted by hedges (sequences of terms) instead of just terms. Consequently, this notion of rewriting subsumes both standard term rewriting a...
متن کاملLongevity Hedge Effectiveness: A Decomposition
We use a case study of a pension plan wishing to hedge the longevity risk in its pension liabilities at a future date. The plan has the choice of using either a customised hedge or an index hedge, with the degree of hedge effectiveness being closely related to the correlation between the value of the hedge and the value of the pension liability. The key contribution of this paper is to show how...
متن کاملEstimation of a Dynamic Hedge
We focus on estimation of parameters used in dynamic hedging strategies and compare objective based inference and the maximum likelihood approach. When the ...nancial model is misspeci...ed the maximum likelihood estimation methodology may be misleading. Objective based estimators belong to the class ofM-estimators, and are actually GMM estimators based on the tracking errors ; their asymptotic...
متن کاملAdaptive Hedge
Most methods for decision-theoretic online learning are based on the Hedge algorithm, which takes a parameter called the learning rate. In most previous analyses the learning rate was carefully tuned to obtain optimal worst-case performance, leading to suboptimal performance on easy instances, for example when there exists an action that is significantly better than all others. We propose a new...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Anaesthesia
سال: 1999
ISSN: 0003-2409
DOI: 10.1046/j.1365-2044.1999.00883.x